package ink.lovejinhu.leetcode;

/**
 * @author jinhu
 * created 2021-08-12 16:56
 */
public class Solution_0812 {
    /**
     * 选三个点组成最大面积的三角形
     *
     * @param points
     * @return
     */
    public double largestTriangleArea(int[][] points) {
        /**
         *
         */
        return 0.0;
    }
}
